P.S. Alexandroff and Topology: an introductory note

An Alexandroff topology on graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

An Alexandroff Topology on Graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersection of each family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an elem...

an alexandroff topology on graphs

let g = (v,e) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. in this paper, we associate a topology to g, called graphic topology of g and we show that it is an alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. then we investigate some properties of this topology. our motivation is to give an e...

Introductory Topology

Navigating the Topology of 2x2 Games: An Introductory Note on Payoff Families, Normalization, and Natural Order

The Robinson-Goforth topology of swaps in adjoining payoffs elegantly arranges 2x2 ordinal games in accordance with important properties including symmetry, number of dominant strategies and Nash Equilibria, and alignment of interests. Adding payoff families based on Nash Equilibria illustrates an additional aspect of this order and aids visualization of the topology. Making ties through half-s...